Optimal Low-Complexity Orthogonal Block Based Detection of OTFS for Low-Dispersion Channels

نویسندگان

چکیده

Orthogonal time frequency space (OTFS) modulation constitutes a promising technology for high-mobility scenarios. However, the detection of OTFS systems imposes substantial complexity. Hence, we propose novel orthogonal block (OB) based scheme significantly reducing complexity without any performance loss with integer Doppler shifts. This is achieved by recognizing that received signal can be partitioned into multiple parallel blocks. Therefore, data symbols within an only depends on signals this reduced dimension. Explicitly, graph theory identification algorithm, which models relationship between and original information as bipartite graph, where depth first search (DFS) algorithm invoked partitioning For each block, existing algorithms used. Since size blocks may much lower than signals, reduced. example, OB MMSE detector approximately factor 4096 traditional channel having two paths.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Low-Complexity Equalization for Orthogonal Time and Frequency Signaling (OTFS)

Recently, a new precoding technique called orthogonal time-frequency signaling (OTFS) has been proposed for timeand frequency-selective communication channels. OTFS precodes a data frame with a complete set of spreading sequences and transmits the results via orthogonal frequency division multiplexing (OFDM). OTFS uses two dimensional (2D) linear spreading sequences in time and frequency which ...

متن کامل

Low-complexity symbol timing error detection for quasi-orthogonal space??time block codes

The author presents the design and analysis of low-complexity symbol timing error detectors (TEDs) for timing synchronisation in quasi-orthogonal space–time block code (QOSTBC) receivers. The estimators operate on data symbols and approximate decision variables, producing timing error measurements which are shown to be robust to channel fading. In evaluating the detector S-curve for the general...

متن کامل

Low-Complexity Iterative Detection for Orthogonal Time Frequency Space Modulation

We elaborate on the recently proposed orthogonal time frequency space (OTFS) modulation technique, which provides significant advantages over orthogonal frequency division multiplexing (OFDM) in Doppler channels. We first derive the input–output relation describing OTFS modulation and demodulation (mod/demod) for delay–Doppler channels with arbitrary number of paths, with given delay and Dopple...

متن کامل

Low Complexity List Detection for High-Rate MIMO Channels

We propose a low-complexity method approximating a-posteriori probability calculation for high-dimensional multipleantenna systems. This sub-optimal method can be used as a component of an iterative decoder for space-time channels. The proposed method out-performs sphere-decoder based approaches, yet requires lower complexity.

متن کامل

Optimal low-dispersion low-dissipation LBM schemes for computational aeroacoustics

Lattice Boltmzmann Methods (LBM) have been proved to be very effective methods for computational aeroacoustics (CAA), which have been used to capture the dynamics of weak acoustic fluctuations. In this paper, we propose a strategy to reduce the dispersive and disspative errors of the two-dimensional (2D) multi-relaxation-time lattice Boltzmann method (MRT-LBM). By presenting an effective algori...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Vehicular Technology

سال: 2023

ISSN: ['0018-9545', '1939-9359']

DOI: https://doi.org/10.1109/tvt.2022.3224848